NUMERICAL SIMULATIONS OF MIXED STATE QUANTUM COMPUTATION

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical simulations of mixed states quantum computation

We describe quantum-octave package of functions useful for simulations of quantum algorithms and protocols. Presented package allows to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations – partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum erro...

متن کامل

Cluster-state Quantum Computation

This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum state known as a cluster state. We also discuss a few novel properties of the model, including a proof that the cluster state cannot occur as the exact ground ...

متن کامل

Numerical Simulations of Quantum Phase Transitions

In this talk I will describe some examples of quantum phase transitions with disorder and explain in what ways these transitions diier from conventional phase transitions at nite temperature. It will be explained that the-expansion does not work and so much of what we know has come from numerical simulations. A novel feature is the importance of \Griiths singularities", which come from rare, st...

متن کامل

Studies on the Role of Entanglement in Mixed-state Quantum Computation

OF DISSERTATION Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Physics The University of New Mexico Albuquerque, New Mexico

متن کامل

Improved constructions of mixed state quantum automata

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A. Ambainis and R. Freivalds that quantum finite automata with pure states can have an exponentially smaller number of states than deterministic finite automata recognizing the same language. There was an unpublished ‘‘folk th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Quantum Information

سال: 2005

ISSN: 0219-7499,1793-6918

DOI: 10.1142/s0219749905000748